Minimizing quadratic functions with semidefinite Hessian subject to bound constraints
نویسندگان
چکیده
منابع مشابه
Minimizing Nonconvex Quadratic Functions Subject to Bound Constraints
We present an active-set algorithm for finding a local minimizer to a nonconvex bound-constrained quadratic problem. Our algorithm extends the ideas developed by Dostál and Schöberl that is based on the linear conjugate gradient algorithm for (approximately) solving a linear system with a positive-definite coefficient matrix. This is achieved by making two key changes. First, we perform a line ...
متن کاملMinimizing Quadratic Functions Subject to Bound Constraints with the Rate of Convergence and Finite Termination
A new active set based algorithm is proposed that uses the conjugate gradient method to explore the face of the feasible region defined by the current iterate and the reduced gradient projection with the fixed steplength to expand the active set. The precision of approximate solutions of the auxiliary unconstrained problems is controlled by the norm of violation of the Karush-Kuhn-Tucker condit...
متن کاملSuperrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
The paper resolves the problem concerning the rate of convergence of the working set based MPRGP (modified proportioning with reduced gradient projection) algorithm with a long steplength of the reduced projected gradient step. The main results of this paper are the formula for the R-linear rate of convergence of MPRGP in terms of the spectral condition number of the Hessian matrix and the proo...
متن کاملMinimizing quadratic functions with separable quadratic constraints
This article deals with minimizing quadratic functions with a special form of quadratic constraints that arise in 3D contact problems of linear elasticity with isotropic friction [Haslinger, J., Kučera, R. and Dostál, Z., 2004, An algorithm for the numerical realization of 3D contact problems with Coulomb friction. Journal of Computational and Applied Mathematics, 164/165, 387–408.]. The propos...
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2015
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2015.08.015